Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems
نویسندگان
چکیده
منابع مشابه
Computation of Pseudospectral Abscissa for Large Scale Nonlinear Eigenvalue Problems
We present an algorithm to compute the pseudospectral abscissa for a nonlinear eigenvalue problem. The algorithm relies on global under-estimator and over-estimator functions for the eigenvalue and singular value functions involved. These global models follow from eigenvalue perturbation theory. The algorithm has three particular features. First, it converges to the globally rightmost point of ...
متن کاملAn Iterative Method for Computing the Pseudospectral Abscissa for a Class of Nonlinear Eigenvalue Problems
where A1, . . . , Am are given n × n matrices and the functions p1, . . . , pm are assumed to be entire. This does not only include polynomial eigenvalue problems but also eigenvalue problems arising from systems of delay differential equations. Our aim is to compute the -pseudospectral abscissa, i.e. the real part of the rightmost point in the -pseudospectrum, which is the complex set obtained...
متن کاملIterative Projection Methods for Large–scale Nonlinear Eigenvalue Problems
In this presentation we review iterative projection methods for sparse nonlinear eigenvalue problems which have proven to be very efficient. Here the eigenvalue problem is projected to a subspace V of small dimension which yields approximate eigenpairs. If an error tolerance is not met then the search space V is expanded in an iterative way with the aim that some of the eigenvalues of the reduc...
متن کاملParallel Evolutionary Computation in Very Large Scale Eigenvalue Problems
The history of research on eigenvalue problems is rich with many outstanding contributions. Nonetheless, the rapidly increasing size of data sets requires new algorithms for old problems in the context of extremely large matrix dimensions [21]. This paper reports on new methods for finding eigenvalues of very large matrices by a synthesis of evolutionary computation, parallel programming, and e...
متن کاملRobust Successive Computation of Eigenpairs for Nonlinear Eigenvalue Problems
Newton-based methods are well-established techniques for solving nonlinear eigen-value problems. If, however, a larger portion of the spectrum is sought, their tendency to reconverge to previously determined eigenpairs is a hindrance. To overcome this limitation, we propose and analyze a deflation strategy for nonlinear eigenvalue problems, based on the concept of minimal invariant pairs. We de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IMA Journal of Numerical Analysis
سال: 2017
ISSN: 0272-4979,1464-3642
DOI: 10.1093/imanum/drw065